Maintaining State in Propagation Solvers
Identifieur interne : 000C79 ( Main/Exploration ); précédent : 000C78; suivant : 000C80Maintaining State in Propagation Solvers
Auteurs : M. Reischuk [Allemagne] ; Christian Schulte [Suède] ; J. Stuckey [Australie] ; Guido Tack [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But search requires the solver to return to a previous state. Hence a propagation solver must determine how to maintain state during propagation and forward and backward search. This paper sets out the possible ways in which a propagation solver can choose to maintain state, and the restrictions that such choices place on the resulting system. Experiments illustrate the result of various choices for the three principle state components of a solver: variables, propagators, and dependencies between them. This paper also provides the first realistic comparison of trailing versus copying for state restoration.
Url:
DOI: 10.1007/978-3-642-04244-7_54
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001311
- to stream Istex, to step Curation: 000F96
- to stream Istex, to step Checkpoint: 000750
- to stream Main, to step Merge: 000C89
- to stream Main, to step Curation: 000C79
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Maintaining State in Propagation Solvers</title><author><name sortKey="Reischuk, M" sort="Reischuk, M" uniqKey="Reischuk M" first="M." last="Reischuk">M. Reischuk</name></author><author><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name></author><author><name sortKey="Stuckey, J" sort="Stuckey, J" uniqKey="Stuckey J" first="J." last="Stuckey">J. Stuckey</name></author><author><name sortKey="Tack, Guido" sort="Tack, Guido" uniqKey="Tack G" first="Guido" last="Tack">Guido Tack</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:07038088087859EF3511E83F4F08F9B135A3F2F8</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-04244-7_54</idno><idno type="url">https://api.istex.fr/document/07038088087859EF3511E83F4F08F9B135A3F2F8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001311</idno><idno type="wicri:Area/Istex/Curation">000F96</idno><idno type="wicri:Area/Istex/Checkpoint">000750</idno><idno type="wicri:doubleKey">0302-9743:2009:Reischuk M:maintaining:state:in</idno><idno type="wicri:Area/Main/Merge">000C89</idno><idno type="wicri:Area/Main/Curation">000C79</idno><idno type="wicri:Area/Main/Exploration">000C79</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Maintaining State in Propagation Solvers</title><author><name sortKey="Reischuk, M" sort="Reischuk, M" uniqKey="Reischuk M" first="M." last="Reischuk">M. Reischuk</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>IS&C, Saarland University, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>KTH - Royal Institute of Technology</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author><author><name sortKey="Stuckey, J" sort="Stuckey, J" uniqKey="Stuckey J" first="J." last="Stuckey">J. Stuckey</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne</wicri:regionArea><wicri:noRegion>University of Melbourne</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Tack, Guido" sort="Tack, Guido" uniqKey="Tack G" first="Guido" last="Tack">Guido Tack</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>PS Lab, Saarland University, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">07038088087859EF3511E83F4F08F9B135A3F2F8</idno><idno type="DOI">10.1007/978-3-642-04244-7_54</idno><idno type="ChapterID">Chap54</idno><idno type="ChapterID">54</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But search requires the solver to return to a previous state. Hence a propagation solver must determine how to maintain state during propagation and forward and backward search. This paper sets out the possible ways in which a propagation solver can choose to maintain state, and the restrictions that such choices place on the resulting system. Experiments illustrate the result of various choices for the three principle state components of a solver: variables, propagators, and dependencies between them. This paper also provides the first realistic comparison of trailing versus copying for state restoration.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Australie</li><li>Suède</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Reischuk, M" sort="Reischuk, M" uniqKey="Reischuk M" first="M." last="Reischuk">M. Reischuk</name></region><name sortKey="Reischuk, M" sort="Reischuk, M" uniqKey="Reischuk M" first="M." last="Reischuk">M. Reischuk</name><name sortKey="Tack, Guido" sort="Tack, Guido" uniqKey="Tack G" first="Guido" last="Tack">Guido Tack</name><name sortKey="Tack, Guido" sort="Tack, Guido" uniqKey="Tack G" first="Guido" last="Tack">Guido Tack</name></country><country name="Suède"><noRegion><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name></noRegion><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name></country><country name="Australie"><noRegion><name sortKey="Stuckey, J" sort="Stuckey, J" uniqKey="Stuckey J" first="J." last="Stuckey">J. Stuckey</name></noRegion><name sortKey="Stuckey, J" sort="Stuckey, J" uniqKey="Stuckey J" first="J." last="Stuckey">J. Stuckey</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C79 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000C79 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:07038088087859EF3511E83F4F08F9B135A3F2F8
|texte= Maintaining State in Propagation Solvers
}}
| This area was generated with Dilib version V0.6.20. |  |